Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

This paper presents a path-based distance where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute a translated version of a neighborhood sequence distance map both for periodic and aperiodic sequences and a method to derive the centered distance map. A decomposition of the grid neighbors, in Z and Z, allows to significantly decrease the number of displacement vectors needed for the distance transform. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image. @article{normand2012cviu, Author = {Normand, Nicolas and Strand, Robin and Evenou, Pierre and Arlicot, Aurore}, Doi = {10.1016/j.cviu.2012.08.015}, Journal = {Computer Vision and Image Understanding}, Title = {Minimal-Delay Distance Transform for Neighborhood-Sequence Distances in 2{D} and 3{D}}, Year = {2013}, Note = {In Press} } The original publication is available at ScienceDirect.com: http://dx.doi.org/10.1016/j.cviu.2012.08.015 SHERPA/RoMEO: green http://www.sherpa.ac.uk/romeo/issn/1077-3142/ ∗Corresponding author Email addresses: [email protected] (Nicolas Normand), [email protected] (Robin Strand), [email protected] (Pierre Evenou), [email protected] (Aurore Arlicot) Preprint submitted to Elsevier